Depends on #267 to be merged first
Fixes #167

There were multiple ways to solve this problem:

• Keep 2 representations of the graph internally and use the "correct" one for each algorithm
  Disadvantage on memory
• Represent a three-winding transformer as a star and adjust algorithms where necessary.
  Disadvantage: a lot of current algorithms/queries become harder, since you always need to hop / remove the node.
• Keep representation as is (a cycle), but fix the algorithms that are hit by the problem (currently only 2 that share a lot of similarity)

Neither option is perfect, but for now keeping it mostly as is and fixing the two algorithms that were incorrect seems like the easiest/cleanest option.
For these algorithms we:

• Remove one edge of the cycle (if all three active)
• Perform normal algorithm
• If any of the returned paths contains all three nodes of the three winding transformer after each other, we know that in reality we would have taken the removed edge instead of "walking through the three winding trafo". So we replace those
• Return to user
  This way we do not return additional paths that are not there, nor do we see cycles that are not there (since we removed the cycles introduced by the three winding trafo's).

Later if we add even more algorithm we can always revisit again en see whether one of the other option becomes a better solution.